A Monotonic Core Concept for Convex Games: the Sd-prenucleolus
نویسندگان
چکیده
We prove that the SD-prenucleolus satis es monotonicity in the class of convex games. The SD-prenucleolus is thus the only known continuous core concept that satis es monotonicity for convex games. We also prove that for convex games the SD-prenucleolus and the SD-prekernel coincide. Keywords: TU games, prenucleolus, monotonicity. Keywords: TU games, prenucleolus, monotonicity JEL classi cation: C71, C72. Dpto. Ftos. A. Económico I, University of the Basque Country, L. Agirre 83, 48015 Bilbao, Spain. Email: [email protected]. J. Arin acknowledges the support of the Spanish Ministerio de Ciencia e Innovación under projects ECO2012-31346 and by Basque Government funding for Grupo Consolidado GIC07/146-IT-377-07. ySt Petersburg Institute for Economics and Mathematics. Email: [email protected]
منابع مشابه
The SD-prenucleolus for TU games
We introduce and characterize a new solution concept for TU games. The new solution is called SD-prenucleolus and is a lexicographic value although is not a weighted prenucleolus. The SD-prenucleolus satis es several desirable properties and is the only known solution that satis es core stability, strong aggregate monotonicity and null player out property in the class of balanced games. The SD-...
متن کاملConvex Games versus clan Games
In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a dualize and restrictprocedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each monotonic convex game generates a total clan game with zero worth for the clan by a dualize and extend pr...
متن کاملFast computation of the leastcore and prenucleolus of cooperative games
The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among N players. It has, however, the drawback being a linear programming problem with 2 − 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approa...
متن کاملThe prenucleolus for games with restricted cooperation
A game with a restricted cooperation is a triple (N, v,Ω), where N is a finite set of players, Ω ⊂ 2 , N ∈ Ω is a collection of feasible coalitions, v : Ω→ R is a characteristic function. The definition implies that if Ω = 2 , then the game (N, v,Ω) = (N, v) is the classical TU cooperative game. The class of all games with a restricted cooperation G with an arbitrary universal set of players is...
متن کاملCoincidence of and collinearity between game theoretic solutions
The first part is the study of several conditions which are sufficient for the coincidence of the prenucleolus concept and the egalitarian nonseparable contribution (ENSC-) method. The main sufficient condition for the coincidence involved requires that the maximal excesses at the ENSC-solution are determined by the ( n 1)-person coalitions in the n-person game. The second part is the study of ...
متن کامل